Hom Complexes of Set Systems
نویسنده
چکیده
A set system is a pair S = (V (S),∆(S)), where ∆(S) is a family of subsets of the set V (S). We refer to the members of ∆(S) as the stable sets of S. A homomorphism between two set systems S and T is a map f : V (S) → V (T ) such that the preimage under f of every stable set of T is a stable set of S. Inspired by a recent generalization due to Engström of Lovász’s Hom complex construction, the author associates a cell complex Hom(S, T ) to any two finite set systems S and T . The main goal of the paper is to examine basic topological and homological properties of this cell complex for various pairs of set systems.
منابع مشابه
Fuzzy projective modules and tensor products in fuzzy module categories
Let $R$ be a commutative ring. We write $mbox{Hom}(mu_A, nu_B)$ for the set of all fuzzy $R$-morphisms from $mu_A$ to $nu_B$, where $mu_A$ and $nu_B$ are two fuzzy $R$-modules. We make$mbox{Hom}(mu_A, nu_B)$ into fuzzy $R$-module by redefining a function $alpha:mbox{Hom}(mu_A, nu_B)longrightarrow [0,1]$. We study the properties of the functor $mbox{Hom}(mu_A,-):FRmbox{-Mod}rightarrow FRmbox{-Mo...
متن کاملDissections, Hom-complexes and the Cayley trick
We show that certain canonical realizations of the complexes Hom(G,H) and Hom+(G,H) of (partial) graph homomorphisms studied by Babson and Kozlov are in fact instances of the polyhedral Cayley trick. For G a complete graph, we then characterize when a canonical projection of these complexes is itself again a complex, and exhibit several well-known objects that arise as cells or subcomplexes of ...
متن کاملTopology of Hom complexes and test graphs for bounding chromatic number
The Hom complex of homomorphisms between two graphs was originally introduced to provide topological lower bounds on the chromatic number of graphs. In this paper we introduce new methods for understanding the topology of Hom complexes, mostly in the context of Γ-actions on graphs and posets (for some group Γ). We view the Hom(T, •) and Hom(•, G) as functors from graphs to posets, and introduce...
متن کاملThe universality of Hom complexes of graphs
It is shown that given a connected graph T with at least one edge and an arbitrary finite simplicial complex X, there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma. Along the way several results regarding Hom complexes, exponentials of graphs, and subdivisions are established that may be of independent interest.
متن کاملThe Universality of Hom Complexes
It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T, G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma. Along the way several results regarding Hom complexes, exponentials, and subdivision are established that may be of independent interest.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013